package QueueDemo;

public class MyCircleQueue3 {
    public int[] elem;
    public boolean flg = false;
    public int front;
    public int rear;
    public MyCircleQueue3(int k) {
        elem = new int[k];
    }

    public boolean enQueue(int value) {
        if(isFull()){
            return false;
        }
        elem[rear] = value;
        rear = (rear+1) % elem.length;
        flg = true;
        return true;
    }

    public boolean deQueue() {
        if(isEmpty()){
            return false;
        }
        front = (front + 1) % elem.length;
        if(front == rear){
            flg = false;
        }
        return true;
    }

    public int Front() {
        if(isEmpty()){
            return -1;
        }
        return elem[front];
    }

    public int Rear() {
        if(isEmpty()){
            return -1;
        }
        int index = rear == 0 ? elem.length-1 : rear-1;
        return elem[index];
    }

    public boolean isEmpty() {
        if(front == rear && !flg){
            return true;
        }
        return false;
    }

    public boolean isFull() {
       if(front == rear && flg){
           return true;
       }
       return false;
    }

}
